Minimizing the total weighted earliness and tardiness for a sequence of operations in job shops

This paper proposes exact algorithms to generate optimal timing schedules for a given sequence of operations in job shops minimize the total weighted earliness and tardiness. The are proposed two shop scheduling scenarios, one involving due dates only last operation each other all on jobs. Computational experiments benchmark problem instances reveal that, case scenario job, faster than those generated using popular optimization solver. In jobs, competitive with solver terms computation time small medium size problems.